1468E - Four Segments - CodeForces Solution

//Think twice code once :))
#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
 #define pb push_back
 typedef long double ld;
 //typedef __int128 lll;
 signed main(){ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 ll tt=1;cin>>tt;string pi = "3.141592653589793238462643383279";
 while(tt--){ll arr[4];cin>>arr[0]>>arr[1]>>arr[2]>>arr[3];
 sort(arr,arr+4);
 cout<<arr[0]*arr[2]<<'\n';







}
 return 0;
 }





































/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
//sometimes long long ko int krne par tle nhi aata(kaafi ajeeb :())
 // Binary search me r=n+1,l=0&&condition:l+1>r;
 
// for(int i=2;i<=N;i++){
  //  if(prime[i]==0){
    //v.pb(i);
    //for(int j=2*i;j<=N;j+=i){prime[j]++;}
    //}
 //}
 /*int smallestdivisor(int n)
{
    // if divisible by 2
    if (n % 2 == 0)
        return 2;
 
    // iterate from 3 to sqrt(n)
    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0)
            return i;
    }
 
    return n;
}*/
/*ll binpow(ll a,ll b,ll m = LLONG_MAX){
    ll res = 1;
    while (b){
        if (b&1) res = (res*a)%m;
        a = (a*a)%m;
        b>>=1;
    }
    return res;
}*/
/*for(int i=0;i<n;i++){
  if(m[s[i]]==0){
 if(i1==-1){ a[i]+=i+(n-1-i)*(i)+n-1-i;a[i]++;i1=i;}
 else{
  a[i]+=i-i1-1+(n-1-i)*(i-i1-1)+n-1-i;a[i]++;i1=i;
 }
  }
}
for(int i=0;i<n;i++){
  ans-=a[i];
}*/
/////Favorites>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>............................................
/*ll n,k;cin>>n>>k;
 if(n%2==0){
  if(k%n)cout<<k%n<<'\n';
  else{cout<<n<<'\n';}
 }
 else{ll n1=n-1;n1/=2;ll a=(k-1)/n1;ll b=k%n;
  if(b==0){b=n;}b+=a;b%=n;if(b==0){b=n;}
  cout<<b<<'\n';
  
 }*/